Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Recommendation algorithm based on probability matrix factorization and fusing trust
TIAN Baojun, YANG Huyun, FANG Jiandong
Journal of Computer Applications    2019, 39 (10): 2834-2840.   DOI: 10.11772/j.issn.1001-9081.2019030583
Abstract478)      PDF (933KB)(343)       Save
For the problems of low recommendation accuracy, data sparsity and malicious recommendation, a new recommendation model based on Probability Matrix Factorization (PMF) and fusing trust was proposed. Firstly, by establishing a Collaborative Filtering Model based on Trust Similarity (CFMTS), the improved trust mechanism was integrated into the collaborative filtering recommendation algorithm. The trust value was obtained through global trust and local trust calculation. The local trust was obtained by calculating the direct trust value and the indirect trust value of the user by the trust propagation mechanism, the global trust was calculated by the trust directed graph. Then, the trust value was combined with the score similarity to solve the problems of data sparsity and malicious recommendation. At the same time, CFMTS was integrated into the PMF model to establish a new recommendation model-Model based on Probability Matrix Factorization and Fusing Trust (MPMFFT). The user feature vectors and the project feature vectors were calculated by the gradient descent algorithm to generate the predicted scores, further improving the accuracy of the recommender system. Through experiments, the proposed MPMFFT was compared with the classical models such as PMF, Social Matrix Factorization (SocialMF), Social Recommendation (SoRec) and Recommendations with Social Trust Ensemble (RSTE). The proposed model has the Mean Absolute Error (MAE) and Root Mean Squared Error (RMSE) decreased by 2.9% and 1.5% respectively compared with the optimal model RSTE on the open real dataset Epinions, and has the MAE and RMSE decreased by 1.1% and 1.8% respectively compared with the optimal SocialMF model on open real dataset Ciao, verifying that the proposed model is significantly improved on the above indicators. The results confirme that the propose model can resolve the problem of data sparseness and malicious recommendation to some extent, and effectively improved the recommendation quality.
Reference | Related Articles | Metrics